منابع مشابه
Function-dependent teams in eco-grammar systems
In this paper, we investigate simple eco-grammar systems with n agents. The number of agents which are active at each derivation step depends on the number of steps which have already been carried out since the beginning of the development. This dependency is expressed by a function f . For each pair of n and f , corresponding language families are defined. These families are compared with each...
متن کاملSimple Eco-Grammar Systems with Prescribed Teams
The notion of teams in grammar systems is applied to a restriction of eco-grammar systems, called simple eco-grammar systems. These systems were introduced by motivations coming from Artiicial Life and (thus) consist of an environment in the form of a Lindenmayer system and agents working on this environment by context-free productions. Several diierent ways of forming teams of agents, with dii...
متن کاملConditional Tabled Eco-grammar Systems versus Et0l Systems
We i n vestigate the generative capacity of the so-called conditional tabled eco-grammar systems CTEG. They are a variant of eco-grammar systems, generative mechanisms recently introduced as models of the interplay b e t ween environment and agents in ecosystems. In particular, we compare the power of CTEG systems with that of programmed and of random context T0L systems and with that of ET0L s...
متن کاملRemarks on Simple Eco-Grammar Systems with Prescribed Teams
In this paper, the simple eco-grammar systems with prescribed teams of ter Beek [2] are reconsidered. We show that limited L systems can be simulated by such systems. Furthermore, we introduce the concept of programming which is imposed upon the prescribed teams of the systems. Depending on the success of the application of a team to the actual state of the system, it is specified which teams a...
متن کاملOn Eco-Grammar Systems and Artificial Neural Networks
Eco-grammar systems and artiicial neural networks have many common features: massive parallelism, independently working elements (agents/neurons), cooperation of the elements and, not least, universal computational power (at least as that of Turing Machine). We prove the possibility to simulate each step of the one type system by the xed number of steps of the another type one without loss of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00110-2